Optimal methods for batch processing problem with makespan and maximum lateness objectives
نویسندگان
چکیده
منابع مشابه
Minimizing Maximum Lateness on Identical Parallel Batch Processing Machines
We consider the problem of scheduling n jobs with release dates on m identical parallel batch processing machines so as to minimize the maximum lateness. Each batch processing machine can process up to B (B < n) jobs simultaneously as a batch, and the processing time of a batch is the largest processing time among the jobs in the batch. Jobs processed in the same batch start and complete at the...
متن کاملNo-wait flowshops with bicriteria of makespan and maximum lateness
In this work we study a flowshop scheduling problem in which jobs are not allowed to wait in-between machines, a situation commonly referred to as no-wait. The concerned criterion is to minimize a weighted sum of makespan and maximum lateness. A dominance relation for the case of three-machine is presented and evaluated by experimental designs. Several heuristics and local search methods are pr...
متن کاملParticle Swarm Optimization Algorithm for Makespan and Maximum Lateness Minimization in Permutation Flowshop Sequencing Problem
In this paper, a particle swarm optimization algorithm (PSO) is presented to solve the permutaion flowshop sequencing problem (PFSP) with the objectives of minimizing makespan and maximum lateness of jobs, respectively. Simple but very efficient local search based on variable neighborhood search (VNS) is embedded in the particle swarm optimization algorithm to solve the well known benchmark sui...
متن کاملBatch scheduling to minimize maximum lateness
We address the single-machine batch scheduling problem which arises when there are job families and setup requirements exist between these families; our objective is to minimize the maximum lateness. As our main result, we give an improved dynamic program for the solution of the problem. © 1997 Elsevier Science B.V. Kevwords: Analysis of algorithms; Dynamic programming; Production/scheduling
متن کاملA new mathematical model for single machine batch scheduling problem for minimizing maximum lateness with deteriorating jobs
Article history: Received 10 March 2010 Received in revised form July, 25, 2011 Accepted 26 July 2011 Available online 27 July 2011 This paper presents a mathematical model for the problem of minimizing the maximum lateness on a single machine when the deteriorated jobs are delivered to each customer in various size batches. In reality, this issue may happen within a supply chain in which deliv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2010
ISSN: 0307-904X
DOI: 10.1016/j.apm.2009.04.007